N.A. Berdyaev and I.A Ilyin’s anthropological concepts: intersection and rejection points

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Points through Folding and Intersection

Fix an n ≥ 3. Consider the following two operations: given a line with a specified point on the line we can construct a new line through the point which forms an angle with the new line which is a multiple of π/n (folding); and given two lines we can construct the point where they cross (intersection). Starting with the line y = 0 and the points (0, 0) and (1, 0) we determine which points in th...

متن کامل

The Mazur Intersection Property and Farthest Points

K. S. Lau had shown that a reflexive Banach space has the Mazur Intersection Property (MIP) if and only if every closed bounded convex set is the closed convex hull of its farthest points. In this work, we show that in general this latter property is equivalent to a property stronger than the MIP. As corollaries, we recapture the result of Lau and characterize the w*-MIP in dual of RNP spaces.

متن کامل

Classification with rejection: concepts and formal evaluations

Standard classification allocates all processed elements to given classes. Such type of classification assumes that there are only native and no foreign elements, i.e. all processed elements are included in given classes. The quality of standard classification can be measured by two factors: numbers of correctly and incorrectly classified elements, called True Positives and False Positives. Adm...

متن کامل

On Finding Ordinary Intersection Points∗

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n logn). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n logn). Two additiona...

متن کامل

Chapter 8 : Distinct intersection points

Claim 1.1. Let L be a set of n lines in R. Then there exists a nontrivial polynomial f ∈ R[x1, x2, x3] of degree smaller than 3 √ n that vanishes on all the lines of L. Proof. Let P be a set of at most 4n points, that is obtained by arbitrarily choosing 4 √ n points from every line of L. Since ( 3 √ n+3 3 ) > 4n, by Lemma 2.1 of Chapter 5 there exists a nontrivial polynomial f ∈ R[x1, x2, x3] o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Samara Journal of Science

سال: 2016

ISSN: 2309-4370

DOI: 10.17816/snv20164216